منابع مشابه
Half-space General Multigroup Transport Theory*
A method for solving various half-space multigroup transport problems for the case of a general transfer matrix is explained. A non-linear integral equation for the emergent distribution of the albedo problem is derived. Then, by using the full-range completeness of the infinite medium eigenfunctions, the distribution inside the half-space is obtained from the emergent distribution. Finally, th...
متن کاملThe FN Method for Multigroup Transport Theory with Upscattering
An integral transform technique and the FN method are used to develop solutions to a class of multigroup radiation-transport problems. The multigroup model considered allows an anisotropic scattering law and transfer from any group to any group. Computational aspects of the developed solution are discussed, and especially accurate numerical results are reported for two test cases.
متن کاملMultigroup diffusion preconditioners for multiplying fixed-source transport problems
Several preconditioners based on multigroup diffusion are developed for application to multiplying fixed-source transport problems using the discrete ordinates method. By starting from standard, one-group, diffusion synthetic acceleration (DSA), a multigroup diffusion preconditioner is constructed that shares the same fine mesh as the transport problem. As a cheaper but effective alternative, a...
متن کاملMultilevel NDA Methods for Solving Multigroup Eigenvalue Neutron Transport Problems
The nonlinear diffusion acceleration (NDA) method is an efficient and flexible transport iterative scheme for solving reactor-physics problems. This paper presents a fast iterative algorithm for solving multigroup neutron transport eigenvalue problems in one-dimensional slab geometry. The proposed method is defined by a multilevel system of equations that includes multigroup and effective onegr...
متن کاملApproximate Halfspace Range Counting
We present a simple scheme extending the shallow partitioning data structures of Matoušek, that supports efficient approximate halfspace range-counting queries in R with relative error ε. Specifically, the problem is, given a set P of n points in R, to preprocess them into a data structure that returns, for a query halfspace h, a number t so that (1−ε)|h∩P | ≤ t ≤ (1+ε)|h∩P |. One of our data s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Physics
سال: 1969
ISSN: 0022-2488,1089-7658
DOI: 10.1063/1.1664827